Response times from ensembles of accumulators

Accumulators in Context 1 Running head : ACCUMULATORS IN CONTEXT

An integrated theory of context effects in memory retrieval is introduced. The theory, called Retrieval by ACcumulating Evidence in an Architecture (RACE/A), integrates ideas from accumulator models in the cognitive architecture ACT-R. This new theory explains how a particular retrieval from declarative memory is influenced by concurrent cognitive processes. RACE/A accounts for memory interfere...

Secure Accumulators from Euclidean Rings without Trusted Setup

Cryptographic accumulators are well-known to be useful in many situations. However, the most efficient accumulator (the RSA accumulator) it is not secure against a certificate authority who has herself selected the RSA modulus n. We generalize previous work and define the root accumulator in modules over Euclidean rings. We prove that the root accumulator is secure under two different pairs of ...

Practical Anonymous Divisible E-Cash from Bounded Accumulators

We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unlinkability and anonymity, after the seminal work proposed by Canard and Gouget. The main trick of our scheme is the use of a bounded accumulator in combination with the classical binary tree approach. The aims of this...

Gauging the Fractal Dimension of Response Times from Cognitive Tasks

Extracting Response Times from Fluid Analysis of Performance Models

Recent developments in the analysis of stochastic process algebra models allow for transient measures of very large models to be extracted. By performing so-called fluid analysis of stochastic process algebra models, it is now feasible to analyse systems of size 10 states and beyond. This paper seeks to extend the type of measure that can be extracted from this style of fluid analysis. We prese...